Using Approximations to Accelerate Engineering Design Optimization

نویسندگان

  • Virginia Torczon
  • Michael W. Trosset
چکیده

Optimization problems that arise in engineering design arc often characterized by several features that hinder the use of standard nonlinear optimization techniques. Foremost among these features is that the functions used to define the engineering optimization problem often are computationally intensive. Within a standard nonlinear optimization algorithm, the computational expense of evaluating the functions that define the problem would necessarily be incurred for each iteration of the optimization algorithm. Faced with such prohibitive computational costs, an attractive alternative is to make use of surrogates within an optimization context since surrogates can be chosen or constructed so that they are typically much less expensive to compute. For the purposes of this paper, we will focus on the use of algebraic approximations as surrogates for the objective. In this paper we introduce the use of so-called merit functions that explicitly recognize the desirability of improving the current approximation to the objective during the course of the optimization. We define and experiment with the use of merit functions chosen to simultaneously improve both the solution to the optimization problem (the objective) and the quality of the approximation. Our goal is to further improve the effectiveness of our general approach without sacrificing any of its rigor. Key words, design optimization, computer simulation, pattern search, kriging, nonparametric response surface methodology. Subject classification. Applied & NumericM Mathematics

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous Discrete Variable Optimization of Structures Using Approximation Methods

Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...

متن کامل

Improving Power Density of Piezoelectric Vibration-Based Energy Scavengers

Vibration energy harvesting with piezoelectric materials currently generate up to 300 microwatts per cm2, using it to be mooted as an appropriate method of energy harvesting for powering low-power electronics. One of the important problems in bimorph piezoelectric energy harvesting is the generation of the highest power with the lowest weight. In this paper the effect of the shape and geometry ...

متن کامل

PARTICLE SWARM-GROUP SEARCH ALGORITHM AND ITS APPLICATION TO SPATIAL STRUCTURAL DESIGN WITH DISCRETE VARIABLES

Based on introducing two optimization algorithms, group search optimization (GSO) algorithm and particle swarm optimization (PSO) algorithm, a new hybrid optimization algorithm which named particle swarm-group search optimization (PS-GSO) algorithm is presented and its application to optimal structural design is analyzed. The PS-GSO is used to investigate the spatial truss structures with discr...

متن کامل

Comparison Of Methods For Using Reduced Models To Speed Up Design Optimization

In this paper we compare two methods for forming reduced models to speed up geneticalgorithm-based optimization. The methods work by forming functional approximations of the tness function which are used to speed up the GA optimization. One method speeds up the optimization by making the genetic operators more informed. The other method speeds up the optimization by genetically engineering some...

متن کامل

An Incremental-Approximate-Clustering Approach for Developing Dynamic Reduced Models for Design Optimization

In this paper we describe a method for improving genetic-algorithm-based optimization using reduced models. The main idea is to maintain a large sample of the points encountered in the course of the optimization divided into clusters. Least squares quadratic approximations are periodically formed of the entire sample as well as the big enough clusters. These approximations are used as a reduced...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998